Fast Approximation Algorithms for Multicommodity Flow Problems

Approximation Algorithms for Multicommodity Flow

Approximation algorithms for multicommodity flow and shop scheduling problems

Algorithms for multiplayer multicommodity flow problems

We investigate theMultiplayer Multicommodity Flow Problem (MMFP): several players have di erent networks and commodities over a common node set. Pairs of players have contracts where one of them agrees to route the ow of the other player (up to a given capacity) between two speci ed nodes. In return, the second player pays an amount proportional to the ow value. We show that the social optimum ...

@bullet Approximation Schemes for Multicommodity Flow Problems 1 Multicommodity Flow Problem

In this lecture, we will present a general primal-dual approach for solving multicommodity flow problems. This technique could also be viewed as a Lagrangian relaxation approach, which is widely used in optimization, and can also been seen to be similar to the exponential weight method used in online learning and other algorithms. The approach we present extends to more general packing/covering...

Algorithms for Discrete and Continuous Multicommodity Flow Network Interdiction Problems

We consider a network interdiction problem on a multicommodity flow network, in which an attacker disables a set of network arcs in order to minimize the maximum profit that can be obtained from shipping commodities across the network. The attacker is assumed to have some budget for destroying (or “interdicting”) arcs, and each arc is associated with a positive interdiction expense. In this pap...